On partitions of discrete boxes
نویسندگان
چکیده
We prove that any partition of an n-dimensional discrete box into nontrivial sub-boxes must consist of at least 2 sub-boxes, and consider some extensions of this theorem.
منابع مشابه
Cut equivalence of d-dimensional guillotine partitions
A guillotine partition of a d-dimensional axis-aligned box B is a recursive partition of B by axis-aligned hyperplane cuts. The size of a guillotine partition is the number of boxes it contains. Two guillotine partitions are box-equivalent if their boxes satisfy compatible order relations with respect to the axes. (In many works, box-equivalent guillotine partitions are considered identical.) I...
متن کاملOn Sloane's generalization of non-squashing stacks of boxes
Recently, Sloane and Sellers solved a certain box stacking problem related to non– squashing partitions. These are defined as partitions n = p1 + p2 + · · · + pk with 1 ≤ p1 ≤ p2 ≤ · · · ≤ pk wherein p1 + · · · + pj ≤ pj+1 for 1 ≤ j ≤ k − 1. Sloane has also hinted at a generalized box stacking problem which is closely related to generalized non–squashing partitions. We solve this generalized bo...
متن کاملSloane's box stacking problem
Recently, Sloane suggested the following problem: We are given n boxes, labeled 1, 2, . . . , n. For i = 1, . . . , n, box i weighs (m − 1)i grams (where m ≥ 2 is a fixed integer) and box i can support a total weight of i grams. What is the number of different ways to build a single stack of boxes in which no box will be squashed by the weight of the boxes above it? Prior to this generalized pr...
متن کاملOn Cobweb Posets and Discrete F-Boxes Tilings
Abstract F -boxes defined in [6] as hyper-boxes in N∞ discrete space were applied here for the geometric description of the cobweb posetes Hasse diagrams tilings. The F -boxes edges sizes are taken to be values of terms of natural numbers’ valued sequence F . The problem of partitions of hyper-boxes represented by graphs into blocks of special form is considered and these are to be called F -ti...
متن کاملHooks and Powers of Parts in Partitions
Many textbooks contain material on partitions. Two standard references are [A] and [S]. A partition of a natural integer n with parts λ1, . . . , λk is a finite decreasing sequence λ = (λ1 ≥ λ2 ≥ · · · ≥ λk > 0) of natural integers λ1, . . . , λk > 0 such that n = ∑k i=1 λi. We denote by |λ| the content n of λ. Partitions are also written as sums: n = λ1 + · · ·+ λk and one uses also the (abusi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 257 شماره
صفحات -
تاریخ انتشار 2002